0.00/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.10 % Command : run_E %s %d THM 0.09/0.30 % Computer : n017.cluster.edu 0.09/0.30 % Model : x86_64 x86_64 0.09/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.09/0.30 % Memory : 8042.1875MB 0.09/0.30 % OS : Linux 3.10.0-693.el7.x86_64 0.09/0.30 % CPULimit : 960 0.09/0.30 % WCLimit : 120 0.09/0.30 % DateTime : Tue Aug 9 06:04:00 EDT 2022 0.09/0.30 % CPUTime : 0.14/0.41 Running higher-order on 8 cores theorem proving 0.14/0.41 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.14/0.41 # Version: 3.0pre003-ho 0.14/0.42 # Preprocessing class: HSSSSMSSSSMCSSA. 0.14/0.42 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.14/0.42 # Starting ho_unfolding_3 with 600s (5) cores 0.14/0.42 # Starting ehoh_best_sine_rwall with 120s (1) cores 0.14/0.42 # Starting new_bool_3 with 120s (1) cores 0.14/0.42 # Starting new_bool_1 with 120s (1) cores 0.14/0.42 # ehoh_best_sine_rwall with pid 10800 completed with status 0 0.14/0.42 # Result found by ehoh_best_sine_rwall 0.14/0.42 # Preprocessing class: HSSSSMSSSSMCSSA. 0.14/0.42 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.14/0.42 # Starting ho_unfolding_3 with 600s (5) cores 0.14/0.42 # Starting ehoh_best_sine_rwall with 120s (1) cores 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000 0.14/0.42 # ...ProofStateSinE()=5/9 0.14/0.42 # Search class: HHUSF-FFSF11-MSSFFMBC 0.14/0.42 # partial match(2): HHUSF-FFSF11-SSSFFMBN 0.14/0.42 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.14/0.42 # Starting ehoh_best_nonlift with 65s (1) cores 0.14/0.42 # ehoh_best_nonlift with pid 10805 completed with status 0 0.14/0.42 # Result found by ehoh_best_nonlift 0.14/0.42 # Preprocessing class: HSSSSMSSSSMCSSA. 0.14/0.42 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.14/0.42 # Starting ho_unfolding_3 with 600s (5) cores 0.14/0.42 # Starting ehoh_best_sine_rwall with 120s (1) cores 0.14/0.42 # SinE strategy is gf500_gu_R04_F100_L20000 0.14/0.42 # ...ProofStateSinE()=5/9 0.14/0.42 # Search class: HHUSF-FFSF11-MSSFFMBC 0.14/0.42 # partial match(2): HHUSF-FFSF11-SSSFFMBN 0.14/0.42 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.14/0.42 # Starting ehoh_best_nonlift with 65s (1) cores 0.14/0.42 # Preprocessing time : 0.001 s 0.14/0.42 # Presaturation interreduction done 0.14/0.42 0.14/0.42 # Proof found! 0.14/0.42 # SZS status Theorem 0.14/0.42 # SZS output start CNFRefutation 0.14/0.42 thf(decl_22, type, eps1: ($i > $o) > $i). 0.14/0.42 thf(decl_23, type, if1: $o > $i > $i > $i). 0.14/0.42 thf(decl_24, type, eps2: ($i > $o) > $i). 0.14/0.42 thf(decl_25, type, if2: $o > $i > $i > $i). 0.14/0.42 thf(decl_26, type, epred1_0: $o). 0.14/0.42 thf(decl_27, type, esk1_0: $i). 0.14/0.42 thf(decl_28, type, esk2_0: $i). 0.14/0.42 thf(decl_29, type, esk3_0: $i). 0.14/0.42 thf(decl_30, type, esk4_2: $i > $i > $i). 0.14/0.42 thf(decl_31, type, esk5_0: $i). 0.14/0.42 thf(decl_32, type, esk6_0: $i). 0.14/0.42 thf(if2d, axiom, ((if2)=(^[X1:$o, X2:$i, X3:$i]:(eps2 @ (^[X4:$i]:((((X1)&((X4)=(X2)))|(~((X1))&((X4)=(X3))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', if2d)). 0.14/0.42 thf(if1d, axiom, ((if1)=(^[X1:$o, X2:$i, X3:$i]:(eps1 @ (^[X4:$i]:((((X1)&((X4)=(X2)))|(~((X1))&((X4)=(X3))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', if1d)). 0.14/0.42 thf(conj, conjecture, ((if1)=(if2)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj)). 0.14/0.42 thf(choiceax1, axiom, ![X5:$i > $o]:((?[X2:$i]:((X5 @ X2))=>(X5 @ (eps1 @ X5)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', choiceax1)). 0.14/0.42 thf(choiceax2, axiom, ![X5:$i > $o]:(((X5 @ (eps2 @ X5))<=?[X2:$i]:((X5 @ X2)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', choiceax2)). 0.14/0.42 thf(c_0_5, plain, ((if2)=(^[Z0:$o, Z1:$i, Z2:$i]:(eps2 @ (^[Z3:$i]:((((Z0)&((Z3)=(Z1)))|(~((Z0))&(Z3)))))))), inference(fof_simplification,[status(thm)],[if2d])). 0.14/0.42 thf(c_0_6, plain, ((if1)=(^[Z0:$o, Z1:$i, Z2:$i]:(eps1 @ (^[Z3:$i]:((((Z0)&((Z3)=(Z1)))|(~((Z0))&(Z3)))))))), inference(fof_simplification,[status(thm)],[if1d])). 0.14/0.42 thf(c_0_7, negated_conjecture, ~(![X10:$o, X11:$i, X12:$i]:(((eps1 @ (^[Z0:$i]:(((((X10))&((Z0)=(X11)))|(~(((X10)))&((Z0)=(X12)))))))=(eps2 @ (^[Z0:$i]:(((((X10))&((Z0)=(X11)))|(~(((X10)))&((Z0)=(X12)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), c_0_5]), c_0_6])])). 0.14/0.42 thf(c_0_8, plain, ![X18:$i > $o, X19:$i]:((~(X18 @ X19)|(X18 @ (eps1 @ X18)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[choiceax1])])])). 0.14/0.42 thf(c_0_9, negated_conjecture, ((eps1 @ (^[Z0:$i]:(((((epred1_0))&((Z0)=(esk1_0)))|(~(((epred1_0)))&((Z0)=(esk2_0)))))))!=(eps2 @ (^[Z0:$i]:(((((epred1_0))&((Z0)=(esk1_0)))|(~(((epred1_0)))&((Z0)=(esk2_0)))))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])). 0.14/0.42 thf(c_0_10, plain, ![X5:$i > $o, X2:$i]:(((X5 @ (eps1 @ X5))|~((X5 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.14/0.42 thf(c_0_11, plain, ![X5:$i > $o]:((?[X2:$i]:((X5 @ X2))=>(X5 @ (eps2 @ X5)))), inference(fof_simplification,[status(thm)],[choiceax2])). 0.14/0.42 thf(c_0_12, negated_conjecture, ((eps1 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))!=(eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))), inference(split_conjunct,[status(thm)],[c_0_9])). 0.14/0.42 thf(c_0_13, plain, ![X2:$i]:(((eps1 @ (^[Z0:$i]:(((Z0)=(X2)))))=(X2))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_10])). 0.14/0.42 thf(c_0_14, plain, ![X16:$i > $o, X17:$i]:((~(X16 @ X17)|(X16 @ (eps2 @ X16)))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])). 0.14/0.42 thf(c_0_15, plain, ((^[Z0:$i]:(((Z0)=(eps2 @ (^[Z1:$i]:((((epred1_0)&((Z1)=(esk1_0)))|(~((epred1_0))&((Z1)=(esk2_0))))))))))!=(^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0))))))), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_12, c_0_13])])). 0.14/0.42 thf(c_0_16, plain, ![X5:$i > $o, X2:$i]:(((X5 @ (eps2 @ X5))|~((X5 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.14/0.42 thf(c_0_17, plain, (((esk3_0)=(eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0))))))))<~>(((epred1_0)&((esk3_0)=(esk1_0)))|(~((epred1_0))&((esk3_0)=(esk2_0))))), inference(neg_ext,[status(thm)],[c_0_15])). 0.14/0.42 thf(c_0_18, negated_conjecture, ![X2:$i]:((((epred1_0)&((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))=(esk1_0)))|(~((epred1_0))&((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))=(esk2_0)))|~((((epred1_0)&((X2)=(esk1_0)))|(~((epred1_0))&((X2)=(esk2_0))))))), inference(choice_inst,[status(thm)],[c_0_12, c_0_16])). 0.14/0.42 thf(c_0_19, plain, (((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))!=(esk3_0))|((esk1_0)!=(esk3_0))|~((epred1_0))), inference(dynamic cnf,[status(thm)],[c_0_17])). 0.14/0.42 thf(c_0_20, negated_conjecture, (((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))=(esk1_0))|~((epred1_0))), inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_18])])])). 0.14/0.42 thf(c_0_21, plain, (((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))=(esk3_0))|((esk1_0)=(esk3_0))|((esk2_0)=(esk3_0))), inference(dynamic cnf,[status(thm)],[c_0_17])). 0.14/0.42 thf(c_0_22, plain, (((esk1_0)!=(esk3_0))|~((epred1_0))), inference(spm,[status(thm)],[c_0_19, c_0_20])). 0.14/0.42 thf(c_0_23, plain, (((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))=(esk3_0))|((esk2_0)=(esk3_0))|(epred1_0)), inference(dynamic cnf,[status(thm)],[c_0_17])). 0.14/0.42 thf(c_0_24, negated_conjecture, (((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))=(esk2_0))|(epred1_0)), inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic cnf,[status(thm)],[c_0_18])])])). 0.14/0.42 thf(c_0_25, plain, (((esk2_0)=(esk3_0))|~((epred1_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_20]), c_0_22])). 0.14/0.42 thf(c_0_26, plain, ((epred1_0)|((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))!=(esk3_0))|((esk2_0)!=(esk3_0))), inference(dynamic cnf,[status(thm)],[c_0_17])). 0.14/0.42 thf(c_0_27, plain, ((esk2_0)=(esk3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25])). 0.14/0.42 thf(c_0_28, plain, ((epred1_0)|((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))!=(esk3_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26, c_0_27])])). 0.14/0.42 thf(c_0_29, negated_conjecture, (epred1_0), inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_24, c_0_27]), c_0_28])). 0.14/0.42 thf(c_0_30, negated_conjecture, ((eps2 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))=(esk1_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20, c_0_29])])). 0.14/0.42 thf(c_0_31, negated_conjecture, ((eps1 @ (^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0)))))))!=(esk1_0)), inference(rw,[status(thm)],[c_0_12, c_0_30])). 0.14/0.42 thf(c_0_32, plain, ((^[Z0:$i]:((((epred1_0)&((Z0)=(esk1_0)))|(~((epred1_0))&((Z0)=(esk2_0))))))!=(^[Z0:$i]:(((Z0)=(esk1_0))))), inference(er,[status(thm)],[inference(ext_sup,[status(thm)],[c_0_31, c_0_13])])). 0.14/0.42 thf(c_0_33, plain, ($false), inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_32]), c_0_29]), c_0_29]), c_0_27])])]), ['proof']). 0.14/0.42 # SZS output end CNFRefutation 0.14/0.42 # Parsed axioms : 9 0.14/0.42 # Removed by relevancy pruning/SinE : 4 0.14/0.42 # Initial clauses : 3 0.14/0.42 # Removed in clause preprocessing : 0 0.14/0.42 # Initial clauses in saturation : 3 0.14/0.42 # Processed clauses : 59 0.14/0.42 # ...of these trivial : 0 0.14/0.42 # ...subsumed : 8 0.14/0.42 # ...remaining for further processing : 50 0.14/0.42 # Other redundant clauses eliminated : 9 0.14/0.42 # Clauses deleted for lack of memory : 0 0.14/0.42 # Backward-subsumed : 3 0.14/0.42 # Backward-rewritten : 21 0.14/0.42 # Generated clauses : 117 0.14/0.42 # ...of the previous two non-redundant : 93 0.14/0.42 # ...aggressively subsumed : 0 0.14/0.42 # Contextual simplify-reflections : 3 0.14/0.42 # Paramodulations : 62 0.14/0.42 # Factorizations : 0 0.14/0.42 # NegExts : 4 0.14/0.42 # Equation resolutions : 10 0.14/0.42 # Propositional unsat checks : 0 0.14/0.42 # Propositional check models : 0 0.14/0.42 # Propositional check unsatisfiable : 0 0.14/0.42 # Propositional clauses : 0 0.14/0.42 # Propositional clauses after purity: 0 0.14/0.42 # Propositional unsat core size : 0 0.14/0.42 # Propositional preprocessing time : 0.000 0.14/0.42 # Propositional encoding time : 0.000 0.14/0.42 # Propositional solver time : 0.000 0.14/0.42 # Success case prop preproc time : 0.000 0.14/0.42 # Success case prop encoding time : 0.000 0.14/0.42 # Success case prop solver time : 0.000 0.14/0.42 # Current number of processed clauses : 20 0.14/0.42 # Positive orientable unit clauses : 3 0.14/0.42 # Positive unorientable unit clauses: 5 0.14/0.42 # Negative unit clauses : 5 0.14/0.42 # Non-unit-clauses : 7 0.14/0.42 # Current number of unprocessed clauses: 38 0.14/0.42 # ...number of literals in the above : 68 0.14/0.42 # Current number of archived formulas : 0 0.14/0.42 # Current number of archived clauses : 30 0.14/0.42 # Clause-clause subsumption calls (NU) : 73 0.14/0.42 # Rec. Clause-clause subsumption calls : 63 0.14/0.42 # Non-unit clause-clause subsumptions : 8 0.14/0.42 # Unit Clause-clause subsumption calls : 20 0.14/0.42 # Rewrite failures with RHS unbound : 0 0.14/0.42 # BW rewrite match attempts : 100 0.14/0.42 # BW rewrite match successes : 51 0.14/0.42 # Condensation attempts : 0 0.14/0.42 # Condensation successes : 0 0.14/0.42 # Termbank termtop insertions : 5927 0.14/0.42 0.14/0.42 # ------------------------------------------------- 0.14/0.42 # User time : 0.008 s 0.14/0.42 # System time : 0.001 s 0.14/0.42 # Total time : 0.009 s 0.14/0.42 # Maximum resident set size: 1804 pages 0.14/0.42 0.14/0.42 # ------------------------------------------------- 0.14/0.42 # User time : 0.010 s 0.14/0.42 # System time : 0.001 s 0.14/0.42 # Total time : 0.011 s 0.14/0.42 # Maximum resident set size: 1716 pages 0.14/0.42 EOF